Ant Colony Optimization with Genetic Operation and Its Application to Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Ant Colony Optimization with Genetic Operation and Its Application to Traveling Salesman Problem
Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to optimization problems. However, in the ACO algorithms it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this work, we propose an improved ACO algorithm in which some of ants can ev...
متن کاملAnt Colony Optimization with Memory and Its Application to Traveling Salesman Problem
proposed to improve the performance of the ACO algorithm. In this paper an ant colony optimization with memory is proposed, which is applied to the classical traveling salesman problem (TSP). In the proposed algorithm, each ant searches the solution not only according to the pheromone and heuristic information but also based on the memory which is from the solution of the last iteration. A larg...
متن کاملSelf-evolving Ant Colony Optimization and Its Application to Traveling Salesman Problem
Ant colony optimization (ACO) algorithms are a recently developed, population-based approach which has been successfully applied to combinatorial optimization problems. However, in the ACO algorithms, it is difficult to adjust the balance between intensification and diversification and thus the performance is not always very well. In this paper we proposed an improved ACO algorithm in which a s...
متن کاملParallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a ...
متن کاملAnt Colony Optimization for Solving Traveling Salesman Problem
An ant colony capable of solving the traveling salesman problem (TSP). TSP is NP-hard problem. Even though the problem itself is simple, when the number of city is large, the search space will become extremely large and it becomes very difficult to find the optimal solution in a short time. One of the main ideas of ant algorithms is the indirect communication of a colony of agents, called (arti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2009
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e92.a.1368